Uniform normal form for general time-bounded complexity classes
نویسندگان
چکیده
منابع مشابه
Some Connections Between Bounded Query Classes and Non-Uniform Complexity
Consider the function F A k (x 1 ; : : :; x k) = A(x 1) A(x k). We show that if F A k can be computed with less than k queries to some set X then A 2 P=poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming p 3 6 = p 3 the hierarchy of functions computed with a bounded number of queries to...
متن کامل2.1 Time-bounded Classes
In the previous lecture, there was a question about whether or not true randomness exists in the universe. This question is still seriously debated by many physicists and philosophers. However, even if true randomness does not exist, it is possible to use pseudorandomness for practical purposes. In any case, randomization is a powerful tool in algorithms design, sometimes leading to more elegan...
متن کاملSome Connections between Bounded Query Classes and Non-Uniform Complexity (Long Version)
Let A(x) be the characteristic function of A. Consider the function Fk (x1, . . . , xk) = A(x1) · · ·A(xk). We show that if F A k can be computed with fewer than k queries to some set X then A ∈ P/poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming Σp3 6= Π p 3, there are functions comp...
متن کاملInstruction sequence based non-uniform complexity classes
We present an approach to non-uniform complexity in which singlepass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes. One kind includes a counterpart of the well-known non-uniform complexity class P/poly and another kind includes a counterpart of the well-known non-uniform complexity ...
متن کاملAverage Time Complexity Classes
We extend Levin's theory of average polynomial time to arbitrary time bounds and prove that average time complexity classes form as ne a hierarchy as do deterministic time complexity classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90034-6